-
1 disjunctive subset
Большой англо-русский и русско-английский словарь > disjunctive subset
-
2 disjunctive subset
Математика: дизъюнктное подмножество -
3 disjunctive subset
-
4 disjunctive subset
The New English-Russian Dictionary of Radio-electronics > disjunctive subset
-
5 disjunctive subset
-
6 subset
1) телефон. абонентский аппарат2) подгруппа3) подкласс4) подмножество5) полукомплект•- almost open subset - almost unitary subset - bounded below subset - countably paracompact subset - everywhere dense subset - linearly independent subset - locally closed subset - locally polyhedral subset - locally tame subset - nonvoid subset - polynomially convex subset - potentially invertible subset - relatively compact subset - relatively pseudocompact subset - right perfect subset - right unitary subset - strongly dependent subset - strongly positive subset - totally ordered subset - uniformly integrable subset - universally measurable subset - weakly bounded subset - weakly closed subset - weakly invariant subset - weak-star closed subset - well ordered subset - well separated subset -
7 subset
1) модем3) подмножество•- analytic subset
- bifurcation subset
- bounded subset
- character subset
- closed subset
- complementary subset
- connected subset
- countable subset
- disjunctive subset
- elementary subset
- enumerable subset
- feature subset
- fundamental subset
- fuzzy subset
- language subset
- local-battery subset
- measurable subset
- numeral subset
- open subset
- ordered subset
- proper subset
- recursive subset
- scattered subset
- tame subset
- uncountable subset -
8 subset
1) модем3) подмножество•- analytic subset
- bifurcation subset
- bounded subset
- character subset
- closed subset
- complementary subset
- connected subset
- countable subset
- disjunctive subset
- elementary subset
- enumerable subset
- feature subset
- fundamental subset
- fuzzy subset
- language subset
- local-battery subset
- measurable subset
- numeral subset
- open subset
- ordered subset
- proper subset
- recursive subset
- scattered subset
- tame subset
- uncountable subsetThe New English-Russian Dictionary of Radio-electronics > subset
-
9 дизъюнктное подмножество
Большой англо-русский и русско-английский словарь > дизъюнктное подмножество
См. также в других словарях:
Surreal number — In mathematics, the surreal number system is an arithmetic continuum containing the real numbers as well as infinite and infinitesimal numbers, respectively larger or smaller in absolute value than any positive real number. The surreals share… … Wikipedia
Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… … Wikipedia
Paraconsistent logic — A paraconsistent logic is a logical system that attempts to deal with contradictions in a discriminating way. Alternatively, paraconsistent logic is the subfield of logic that is concerned with studying and developing paraconsistent (or… … Wikipedia
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… … Wikipedia
List of philosophy topics (D-H) — DDaDai Zhen Pierre d Ailly Jean Le Rond d Alembert John Damascene Damascius John of Damascus Peter Damian Danish philosophy Dante Alighieri Arthur Danto Arthur C. Danto Arthur Coleman Danto dao Daodejing Daoism Daoist philosophy Charles Darwin… … Wikipedia
Description logic — (DL) is a family of formal knowledge representation languages. It is more expressive than propositional logic but has more efficient decision problems than first order predicate logic. DL is used in artificial intelligence for formal reasoning on … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia